statistics & data analysis
Statistics & Data Analysis: Linear Regression Models in SPSS
Linear regression is one of the essential tools in statistical analysis. In this course, we'll walk through step-by-step how to conduct many important analyses using SPSS. Although you will learn the basics of what these statistics are, we'll avoid complicated mathematical discussions and go right to what you need to know to conduct these analyses. Linear regression is basically a tool that allows you to test relationships between many variables at the same time, control for variables' effects, and create simple statistical models that allow you to make predictions. In this course, we'll cover the following key topics: You'll not only learn how to conduct these analyses, we'll also go over how to interpret the statistical results and how to graph the results using SPSS and a special Excel template I've created for you.
Exploiting random projections and sparsity with random forests and gradient boosting methods -- Application to multi-label and multi-output learning, random forest model compression and leveraging input sparsity
Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested $if-then-else$ questions, the testing nodes, leading to a set of predictions, the leaf nodes. Several of such trees are often combined together for state-of-the-art performance: random forest ensembles average the predictions of randomized decision trees trained independently in parallel, while tree boosting ensembles train decision trees sequentially to refine the predictions made by the previous ones. The emergence of new applications requires scalable supervised learning algorithms in terms of computational power and memory space with respect to the number of inputs, outputs, and observations without sacrificing accuracy. In this thesis, we identify three main areas where decision tree methods could be improved for which we provide and evaluate original algorithmic solutions: (i) learning over high dimensional output spaces, (ii) learning with large sample datasets and stringent memory constraints at prediction time and (iii) learning over high dimensional sparse input spaces.